\begin{algorithm}
\caption{$MinimalEquivalentEdgeSet($P_i$,$P_j$,$E_{P_i,P_j}$}
\label{alg:minimalEES}
\begin{algorithmic}[1]
%\REQUIRE{The total number of transactoins $|T|$ and mimimal support level $\alpha$}
\STATE $E^R_{P_i,P_j}=\emptyset$
\STATE return $N$ \\
\end{algorithmic}

\begin{algorithmic}[8]
\PROCEDURE{$RecursiveCounting(j,S,F)$}
     \FOR{$l=j$ to $t$} 
     \STATE $supp \leftarrow 0$ \COMMENT{itemsets support}
     \FOR{$i=1$ to $s$} 
         \STATE $S^\prime[i]=S[i]\times d_{il} $ \COMMENT{a new support vector $S^\prime$}  
         \STATE $supp \leftarrow supp+S^\prime[i]\times a_{i}$
     \ENDFOR
     \IF{$supp \geq \alpha|T|$}  
         \STATE $F^\prime \leftarrow F \times (2^{b_l}-1)$
         \STATE $N \leftarrow N+F^\prime$
         \STATE RecursiveCounting($l+1,S^\prime,F^\prime$)
     \ENDIF
     \ENDFOR
\end{algorithmic}
\end{algorithm}